Lock Contention Management in Multithreaded MPI
نویسندگان
چکیده
منابع مشابه
Forecasting Lock Contention Before Adopting Another Lock Algorithm
Locks are often used in parallel applications to ensure correct behavior, but frequently induce performance bottlenecks caused by contention at frequently accessed locks. There are state-of-the-art locking algorithms, whose performance under high contention is superior to that of the most commonly used ones. However, some of these have a different interface, and adopting them incurs a reimpleme...
متن کاملEfficient Multithreaded Context ID Allocation in MPI
An important aspect of support for multithreaded MPI executions is the management of communication context identifiers (IDs), which are used to associate MPI communication operations with a communicator. New communicator creation functionality in MPI 3.0 adds complexity to this core resource management problem. We present an efficient algorithm for multithreaded context ID allocation that build...
متن کاملLocking Aspects in Multithreaded MPI Implementations
MPI implementations rely mostly on locking to provide thread safety and comply with the MPI standard requirements. Yet despite the large body of literature that targets improving lock scalability and finegrained synchronization, little is known about the arbitration aspect of locking and its effect on MPI implementations. In this paper, we provide an in-depth investigation of the correlation be...
متن کاملContention-Aware Lock Scheduling for Transactional Databases
Lock managers are among the most studied components in concurrency control and transactional systems. However, one question seems to have been generally overlooked: “When there are multiple lock requests on the same object, which one(s) should be granted first?” Nearly all existing systems rely on a FIFO (first in, first out) strategy to decide which transaction(s) to grant the lock to. In this...
متن کاملDurability Semantics for Lock-based Multithreaded Programs
Non-volatile storage connected as memory (NVRAM) offers promising opportunities for simplifying and accelerating manipulation of persistent data. Load and store latency is potentially comparable to that of ordinary memory. The challenge is to ensure that the persisted data remains consistent if a failure occurs during execution, especially in a multithreaded programming environment. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2019
ISSN: 2329-4949,2329-4957
DOI: 10.1145/3275443